An Efficient Hybrid Job Scheduling Algorithm for Computational Grids
نویسندگان
چکیده
Scheduling of jobs is a challenging problem in grid. Efficient job scheduling is essential for the effective utilization of the resources. We propose a grid model as a collection of clusters. In this paper, we apply Divisible Load Theory (DLT) and Least Cost Method (LCM) to model the grid scheduling problem involving multiple worker nodes in each cluster. We propose a hybrid job scheduling algorithm that minimizes the overall processing time of the job in a grid system that consists of heterogeneous hosts. The results show that the proposed algorithm is feasible and
منابع مشابه
A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملAn Efficient Hybrid Job Scheduling Algorithm for Computational Grids
Scheduling of jobs is a challenging problem in grid. Efficient job scheduling is essential for the effective utilization of the resources. We propose a grid model as a collection of clusters. In this paper, we apply Divisible Load Theory (DLT) and Least Cost Method (LCM) to model the grid scheduling problem involving multiple worker nodes in each cluster. We propose a hybrid job scheduling algo...
متن کاملA New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability
Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملTasks Scheduling in Computational Grid using a Hybrid Discrete Particle Swarm Optimization
Computing Grid is a high performance computing environment that allows sharing of geographically distributed resources across multiple administrative domains and used to solve large scale computational demands. To achieve the promising potentials of computational grids, job scheduling is an important issue to be considered. This paper addresses scheduling problem of independent tasks on computa...
متن کامل